The optimal refinement strategy for 3-D simplicial meshes
نویسندگان
چکیده
منابع مشابه
Efficient View - Dependent Refinement of 3 D Meshes using √ 3 - Subdivision
In this paper we introduce an efficient view dependent refinement technique well-suited to adaptive visualization of 3D triangle meshes on a graphic terminal. Our main goal is the design of fast and robust smooth surface reconstruction from coarse meshes. We demonstrate that the √ 3 subdivision operator recently introduced by Kobbelt offers many benefits, including view-dependent refinement, re...
متن کاملSearch of the optimal strategy for refinement of atomic models
Recently it has been shown (Afonine et al, 2001; Lunin et al., 2002) that the approximation of the maximum likelihood criterion (ML) by a quadratic functional (Lunin & Urzhumtsev, 1999) allows to understand the features of the ML refinement and its advantages with respect to the traditional least-squares (LS) refinement. In this latter, the magnitudes { } S calc F ∈ s s of structure factors cal...
متن کاملSpatial Indexes for Simplicial and Cellular Meshes
We address the problem of performing spatial and topological queries on simplicial and cellular meshes. These arise in several application domains including 3D GIS, scientific visualization and finite element analysis. Firstly, we present a family of spatial indexes for tetrahedral meshes, that we call tetrahedral trees. Then, we present the PRstar octree, that is a combined spatial data struct...
متن کاملRefinement operators for triangle meshes
Refinement operators for triangular meshes as used in subdivision schemes or remeshing are discussed. A numbering scheme is presented, covering all refinement operators that (topologically) map vertices onto vertices. Using this characterization, some special properties of n-adic and √ 3-subdivision are easy to see.
متن کاملOptimal Oblivious Routing On D-Dimensional Meshes
In this work we consider deterministic oblivious k-k routing algorithms with buffer size O(k). Our main focus lie is the design of algorithms for dimensional n n meshes, d> 1. For these networks we present asymptotically optimal O(kpnd) step oblivious k-k routing algorithms for all k and d > 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2013
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2013.07.026